A Bijection between Littlewood-richardson Tableaux and Rigged Configurations
نویسندگان
چکیده
We define a bijection from Littlewood–Richardson tableaux to rigged configurations and show that it preserves the appropriate statistics. This proves in particular a quasi-particle expression for the generalized Kostka polynomials KλR(q) labeled by a partition λ and a sequence of rectangles R. The generalized Kostka polynomials are q-analogues of multiplicities of the irreducible GL(n,C)-module V λ of highest weight λ in the tensor product V R1 ⊗ · · · ⊗ V RL .
منابع مشابه
Promotion Operator on Rigged Configurations of Type A
In [14], the analogue of the promotion operator on crystals of type A under a generalization of the bijection of Kerov, Kirillov and Reshetikhin between crystals (or Littlewood– Richardson tableaux) and rigged configurations was proposed. In this paper, we give a proof of this conjecture. This shows in particular that the bijection between tensor products of type A n crystals and (unrestricted)...
متن کاملRibbon tableaux, ribbon rigged configurations and Hall-Littlewood functions at roots of unity
Hall-Littlewood functions indexed by rectangular partitions, specialized at primitive roots of unity, can be expressed as plethysms. We propose a combinatorial proof of this formula using Schilling’s bijection between ribbon tableaux and ribbon rigged configurations.
متن کاملFermionic Formulas for Level-restricted Generalized Kostka Polynomials and Coset Branching Functions
Level-restricted paths play an important rôle in crystal theory. They correspond to certain highest weight vectors of modules of quantum affine algebras. We show that the recently established bijection between Littlewood–Richardson tableaux and rigged configurations is well-behaved with respect to level-restriction and give an explicit characterization of level-restricted rigged configurations....
متن کاملHall-Littlewood functions at roots of unity
Hall-Littlewood functions indexed by rectangular partitions, specialized at primitive roots of unity, can be expressed as plethysms. We propose a combinatorial proof of this formula using A. Schilling’s bijection between ribbon tableaux and ribbon rigged configurations.
متن کاملA promotion operator on rigged configurations
Rigged configurations appear in the Bethe Ansatz study of exactly solvable lattice models as combinatorial objects to index the solutions of the Bethe equations [5, 6]. Based on work by Kerov, Kirillov and Reshetikhin [5, 6], it was shown in [7] that there is a statistic preserving bijection Φ between LittlewoodRichardson tableaux and rigged configurations. The description of the bijection Φ is...
متن کامل